Constrained LQR for low-precision data representation
نویسندگان
چکیده
منابع مشابه
Constrained LQR for low-precision data representation
Performing computations with a low-bit number representation results in a faster implementation that uses less silicon, and hence allows an algorithm to be implemented in smaller and cheaper processors without loss of performance. We propose a novel formulation to efficiently exploit the low (or nonstandard) precision number representation of some computer architectureswhen computing the soluti...
متن کاملInference from Low Precision Transcriptome Data Representation
Microarray measurements are being widely used to infer gene functions, identify regulatory mechanisms and to predict phenotypes. These measurements are usually made and recorded to high numerical precision (e.g. 0.24601). However, aspects of the underlying biology, including mRNA molecules being highly unstable, being only available in very small copy numbers and the measurements usually being ...
متن کاملCompressive Sensing with Low Precision Data Representation: Radio Astronomy and Beyond
Abstract: Modern scientific instruments produce vast amounts of data, which can overwhelm the processing ability of computer systems. Lossy compression of data is an intriguing solution, but comes with its own dangers, such as potential signal loss, and the need for careful parameter optimization. In this work, we focus on a setting where this problem is especially acute—compressive sensing fra...
متن کاملSolving the infinite-horizon constrained LQR problem using splitting techniques
This paper presents a method to solve the constrained infinite-time linear quadratic regulator (LQR) problem. We use an operator splitting technique, namely the alternating minimization algorithm (AMA), to split the problem into an unconstrained LQR problem and a projection step, which are solved repeatedly, with the solution of one influencing the other. The first step amounts to the solution ...
متن کاملSolution of the input-constrained LQR problem using dynamic programming
The input-constrained LQR problem is addressed in this paper; i.e., the problem of finding the optimal control law for a linear system such that a quadratic cost functional is minimised over a horizon of length N subject to the satisfaction of input constraints. A global solution (i.e., valid in the entire state space) for this problem, and for arbitrary horizon N, is derived analytically by us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2014
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2013.09.035